CONNECTIVITY OF THE PRODUCT REPLACEMENT ALGORITHM GRAPH OF PSL(2,q)

نویسنده

  • SHELLY GARION
چکیده

The product replacement algorithm is a practical algorithm to construct random elements of a finite group G. It can be described as a random walk on a graph Γk(G) whose vertices are the generating ktuples of G (for a fixed k). We show that if G = PSL(2, q) or PGL(2, q), where q is a prime power, then Γk(G) is connected for any k ≥ 4. This generalizes former results obtained by Gilman and Evans.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ON THE SZEGED INDEX OF NON-COMMUTATIVE GRAPH OF GENERAL LINEAR GROUP

Let $G$ be a non-abelian group and let $Z(G)$ be the center of $G$. Associate with $G$ there is agraph $Gamma_G$ as follows: Take $Gsetminus Z(G)$ as vertices of$Gamma_G$ and joint two distinct vertices $x$ and $y$ whenever$yxneq yx$. $Gamma_G$ is called the non-commuting graph of $G$. In recent years many interesting works have been done in non-commutative graph of groups. Computing the clique...

متن کامل

A Survey on Complexity of Integrity Parameter

Many graph theoretical parameters have been used to describe the vulnerability of communication networks, including toughness, binding number, rate of disruption, neighbor-connectivity, integrity, mean integrity, edgeconnectivity vector, l-connectivity and tenacity. In this paper we discuss Integrity and its properties in vulnerability calculation. The integrity of a graph G, I(G), is defined t...

متن کامل

Characterization of $mathrm{PSL}(5,q)$ by its Order and One Conjugacy Class Size

Let $p=(q^4+q^3+q^2+q+1)/(5,q-1)$ be a prime number, where $q$ is a prime power. In this paper, we will show $Gcong mathrm{PSL}(5,q)$ if and only if $|G|=|mathrm{PSL}(5,q)|$, and $G$ has a conjugacy class size $frac{| mathrm{PSL}(5,q)|}{p}$. Further, the validity of a conjecture of J. G. Thompson is generalized to the groups under consideration by a new way.

متن کامل

Identification of mild cognitive impairment disease using brain functional connectivity and graph analysis in fMRI data

Background: Early diagnosis of patients in the early stages of Alzheimer's, known as mild cognitive impairment, is of great importance in the treatment of this disease. If a patient can be diagnosed at this stage, it is possible to treat or delay Alzheimer's disease. Resting-state functional magnetic resonance imaging (fMRI) is very common in the process of diagnosing Alzheimer's disease. In th...

متن کامل

Scalar Product Graphs of Modules

Let R be a commutative ring with identity and M an R-module. The Scalar-Product Graph of M is defined as the graph GR(M) with the vertex set M and two distinct vertices x and y are adjacent if and only if there exist r or s belong to R such that x = ry or y = sx. In this paper , we discuss connectivity and planarity of these graphs and computing diameter and girth of GR(M). Also we show some of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007